Polynomial decomposition

Results: 68



#Item
31J Glob Optim:327–345 DOIs10898A scaling algorithm for polynomial constraint satisfaction problems Ferenc Domes · Arnold Neumaier

J Glob Optim:327–345 DOIs10898A scaling algorithm for polynomial constraint satisfaction problems Ferenc Domes · Arnold Neumaier

Add to Reading List

Source URL: www.mat.univie.ac.at

Language: English - Date: 2008-10-09 12:13:48
32Finding Branch-decompositions and Rank-decompositions Petr Hlinˇen´y ∗† Faculty of Informatics Masaryk University Botanick´a 68a, Brno, Czech Rep.

Finding Branch-decompositions and Rank-decompositions Petr Hlinˇen´y ∗† Faculty of Informatics Masaryk University Botanick´a 68a, Brno, Czech Rep.

Add to Reading List

Source URL: www.fi.muni.cz

Language: English - Date: 2008-02-12 04:44:10
33Journal of Artificial Intelligence Research  Submitted 10/10; publishedSoft Constraints of Difference and Equality Emmanuel Hebrard

Journal of Artificial Intelligence Research Submitted 10/10; publishedSoft Constraints of Difference and Equality Emmanuel Hebrard

Add to Reading List

Source URL: homepages.laas.fr

Language: English - Date: 2011-06-09 12:13:27
34Degree distribution in random planar graphs Michael Drmota∗ Omer Gim´enez†  Marc Noy‡

Degree distribution in random planar graphs Michael Drmota∗ Omer Gim´enez† Marc Noy‡

Add to Reading List

Source URL: www.dmg.tuwien.ac.at

Language: English - Date: 2008-09-20 01:50:49
35Longest Paths in Planar DAGs in Unambiguous Log-Space

Longest Paths in Planar DAGs in Unambiguous Log-Space

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2011-06-02 16:29:35
36Independent Set in P5-Free Graphs in Polynomial Time Daniel Lokshtanov∗ Martin Vatshelle∗  Yngve Villanger∗

Independent Set in P5-Free Graphs in Polynomial Time Daniel Lokshtanov∗ Martin Vatshelle∗ Yngve Villanger∗

Add to Reading List

Source URL: www.ii.uib.no

Language: English - Date: 2013-10-25 09:59:52
377.2 FINDING THE EIGENVALUES OF A MATRIX Consider an n × n matrix A and a scalar λ. By definition λ is an eigenvalue of A if there is a nonzero vector ~v in Rn such that A~v = λ~v

7.2 FINDING THE EIGENVALUES OF A MATRIX Consider an n × n matrix A and a scalar λ. By definition λ is an eigenvalue of A if there is a nonzero vector ~v in Rn such that A~v = λ~v

Add to Reading List

Source URL: in1.csie.ncu.edu.tw

Language: English - Date: 2002-12-16 01:43:24
38The Complexity of Accurate Floating Point Computation or Can we Compute Eigenvalues In Polynomial Time? James Demmel Mathematics and Computer Science

The Complexity of Accurate Floating Point Computation or Can we Compute Eigenvalues In Polynomial Time? James Demmel Mathematics and Computer Science

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2002-08-13 17:34:17
39SPLATT: Efficient and Parallel Sparse Tensor-Matrix Multiplication Shaden Smith∗ , Niranjay Ravindran† , Nicholas D. Sidiropoulos† , George Karypis∗ University of Minnesota, Minneapolis, MN 55455, U.S.A. ∗ {sha

SPLATT: Efficient and Parallel Sparse Tensor-Matrix Multiplication Shaden Smith∗ , Niranjay Ravindran† , Nicholas D. Sidiropoulos† , George Karypis∗ University of Minnesota, Minneapolis, MN 55455, U.S.A. ∗ {sha

Add to Reading List

Source URL: glaros.dtc.umn.edu

Language: English - Date: 2015-04-19 01:48:43
40Concentric Tesselation Maps and Curvature Continuous Guided Surfaces K. Karˇciauskas and J. Peters October 23, 2006 Abstract A multi-sided hole in a surface can be filled by a sequence of nested,

Concentric Tesselation Maps and Curvature Continuous Guided Surfaces K. Karˇciauskas and J. Peters October 23, 2006 Abstract A multi-sided hole in a surface can be filled by a sequence of nested,

Add to Reading List

Source URL: www.cise.ufl.edu

Language: English - Date: 2006-10-30 16:27:17